On the Representation of Band Limited Functions Using Finitely Many Bits
نویسندگان
چکیده
منابع مشابه
On the Representation of Band Limited Functions Using Finitely Many Bits
In this paper, we consider the question of representing an entire function of finite order and type in terms of finitely many bits, and reconstructing the function from these. Instead of making any further assumptions about the function, we measure the error in reconstruction in a suitably weighted L norm. The optimal number of bits in order to obtain a given accuracy is given by the Kolmogorov...
متن کاملOn the Representation of Band-Dominant Functions on the Sphere Using Finitely Many Bits
A band-dominant function on the Euclidean sphere embedded in R is the restriction to this sphere of an entire function of q + 1 complex variables having a finite exponential type in each of its variables. We develop a method to represent such a function using finitely many bits, using the values of the function at scattered sites on the sphere. The number of bits required in our representation ...
متن کاملOn the representation of band-limited signals using finitely many bits
In this paper, we consider the question of representing an entire function of finite order and type in terms of finitely many bits, and reconstructing the function from these. Instead of making any further assumptions about the function, we measure the error in reconstruction in a suitably weighted Lp norm. The optimal number of bits in order to obtain a given accuracy is given by the Kolmogoro...
متن کاملthe impact of using inspirational quotes on abstract vocabulary recall
the present study is an attempt to investigate the potential impact of inspirational quotes on improving english abstract vocabulary recall. to achieve this goal, a multiple choice language proficiency test of 60 items including vocabulary and grammar component was administered to a sample of 63 second-semester male and female students whose age ranged between 17 to 22 and they were studying en...
15 صفحه اولOn solubility of groups with finitely many centralizers
For any group G, let C(G) denote the set of centralizers of G.We say that a group G has n centralizers (G is a Cn-group) if |C(G)| = n.In this note, we prove that every finite Cn-group with n ≤ 21 is soluble andthis estimate is sharp. Moreover, we prove that every finite Cn-group with|G| < 30n+1519 is non-nilpotent soluble. This result gives a partial answer to aconjecture raised by A. Ashrafi in ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Complexity
سال: 2002
ISSN: 0885-064X
DOI: 10.1006/jcom.2001.0637